Lelek maps and n-dimensional maps from compacta to polyhedra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scrambled Sets of Continuous Maps of 1-dimensional Polyhedra

Let K be a 1-dimensional simplicial complex in R3 without isolated vertexes, X = |K| be the polyhedron of K with the metric dK induced by K, and f : X → X be a continuous map. In this paper we prove that if K is finite, then the interior of every scrambled set of f in X is empty. We also show that if K is an infinite complex, then there exist continuous maps from X to itself having scrambled se...

متن کامل

A Hierarchy of Maps Between Compacta

This paper, a continuation of [2]–[8], aims to carry on the project of establishing model-theoretic concepts and methods within the topological context; namely that of compacta (i.e., compact Hausdorff spaces). Since there is a precise duality between the categories of compacta (plus continuous maps) and commutative B-algebras (plus nonexpansive linear maps) (the Gel’fand-Năımark theorem [21]),...

متن کامل

Nambu system associated with n-dimensional maps

We studied that arbitrary 2-dimensional maps are Hamilton system if a initial value of map is a ”time” variable. In this paper, we generalize this correspondence, and show that an n-dimensional map is a Nambu system in which one of initial values of the map play a role of ”time” variable.

متن کامل

Pyramids of n-Dimensional Generalized Maps

Graph pyramids are often used for representing irregular pyramids. Combinatorial pyramids have been recently defined for this purpose. We define here pyramids of n-dimensional generalized maps. This is the main contribution of this work: a generic definition in any dimension which extend and generalize the previous works. Moreover, such pyramids explicitly represent more topological information...

متن کامل

CGoGN: n-dimensional Meshes with Combinatorial Maps

Many data structures are available for the representation and manipulation of meshes. In the context of algorithms that need to traverse local neighborhoods, topological structures are of particular interest. Many such existing structures are specialized for the representation of objects of a given dimension like surface or volume meshes. Many of them find their roots in combinatorial maps, a m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2006

ISSN: 0166-8641

DOI: 10.1016/j.topol.2005.03.011